Integer Optimization on Convex Semialgebraic Sets
نویسندگان
چکیده
منابع مشابه
Integer Optimization on Convex Semialgebraic Sets
Let Y be a convex set inRk defined by polynomial inequalities and equations of degree at most d ≥ 2 with integer coefficients of binary length at most l. We show that if the set of optimal solutions of the integer programming problem min{yk | y = (y1, . . . , yk) ∈ Y ∩Zk} is not empty, then the problem has an optimal solution y∗ ∈ Y ∩Zk of binary length ld O(k ). For fixed k, our bound implies ...
متن کاملOptimization of Polynomials on Compact Semialgebraic Sets
A basic closed semialgebraic subset S of Rn is defined by simultaneous polynomial inequalities g1 ≥ 0, . . . , gm ≥ 0. We give a short introduction to Lasserre’s method for minimizing a polynomial f on a compact set S of this kind. It consists of successively solving tighter and tighter convex relaxations of this problem which can be formulated as semidefinite programs. We give a new short proo...
متن کاملUnbounded Convex Semialgebraic Sets as Spectrahedral Shadows
Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the boundary of S is nonsingular and has positive curvature. In this paper, we generalize their result to unbounded sets, and also study the effect of the perspective transform on singularities.
متن کاملMatrix Convex Hulls of Free Semialgebraic Sets
This article resides in the realm of the noncommutative (free) analog of real algebraic geometry – the study of polynomial inequalities and equations over the real numbers – with a focus on matrix convex sets C and their projections Ĉ. A free semialgebraic set which is convex as well as bounded and open can be represented as the solution set of a Linear Matrix Inequality (LMI), a result which s...
متن کاملInteger cells in convex sets
Every convex body K in Rn admits a coordinate projection PK that contains at least vol( 1 6K) cells of the integer lattice PZ n, provided this volume is at least one. Our proof of this counterpart of Minkowski’s theorem is based on an extension of the combinatorial density theorem of Sauer, Shelah and Vapnik-Chervonenkis to Zn. This leads to a new approach to sections of convex bodies. In parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2000
ISSN: 0179-5376
DOI: 10.1007/pl00009496